Tree Reconstruction from Multi-State Characters
نویسندگان
چکیده
منابع مشابه
Tree Reconstruction from Multi-State Characters
In evolutionary biology, a character is a function χ from a set X of present-day species into a finite set of states. Suppose the species in X have evolved according to a bifurcating tree T . Biologists would like to use characters to infer this tree. Assume that χ is the result of an evolutionary process on T that has not involved reverse or parallel transitions, such characters are called hom...
متن کاملMMDT: Multi-Objective Memetic Rule Learning from Decision Tree
In this article, a Multi-Objective Memetic Algorithm (MA) for rule learning is proposed. Prediction accuracy and interpretation are two measures that conflict with each other. In this approach, we consider accuracy and interpretation of rules sets. Additionally, individual classifiers face other problems such as huge sizes, high dimensionality and imbalance classes’ distribution data sets. This...
متن کاملA comparison of ancestral state reconstruction methods for quantitative characters.
Choosing an ancestral state reconstruction method among the alternatives available for quantitative characters may be puzzling. We present here a comparison of seven of them, namely the maximum likelihood, restricted maximum likelihood, generalized least squares under Brownian, Brownian-with-trend and Ornstein-Uhlenbeck models, phylogenetic independent contrasts and squared parsimony methods. A...
متن کاملImproved Lower Bounds on the Compatibility of Multi-State Characters
We study a long standing conjecture on the necessary and sufficient conditions for the compatibility of multi-state characters: There exists a function f(r) such that, for any set C of r-state characters, C is compatible if and only if every subset of f(r) characters of C is compatible. We show that for every r ≥ 2, there exists an incompatible set C of ⌊ r 2 ⌋·⌈ r 2 ⌉+1 r-state characters such...
متن کاملMulti-threaded Explicit State Space Exploration with State Reconstruction
This article introduces a parallel state space exploration algorithm for shared memory multi-core architectures using state compression and state reconstruction to reduce memory consumption. The algorithm proceeds in rounds each consisting of three phases: concurrent expansion of open states, concurrent reduction of potentially new states, and concurrent duplicate detection. An important featur...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Advances in Applied Mathematics
سال: 2002
ISSN: 0196-8858
DOI: 10.1006/aama.2001.0772